The shortest-path problem for graphs with random arc-lengths
نویسندگان
چکیده
منابع مشابه
The shortest-path problem for graphs with random arc-lengths
We consider the problem of finding the shortest distance between all pairs of vertices in a complete digraph on n vertices, whose arc-lengths are non-negative random variables. We describe an algorithm which solves this problem in O(n(m + n log n)) expected time, where m is the expected number of arcs with finite length. If m is small enough, this represents a small improvement over the bound i...
متن کاملNew models for shortest path problem with fuzzy arc lengths
This paper considers the shortest path problem with fuzzy arc lengths. According to different decision criteria, the concepts of expected shortest path, a-shortest path and the most shortest path in fuzzy environment are originally proposed, and three types of models are formulated. In order to solve these models, a hybrid intelligent algorithm integrating simulation and genetic algorithm is pr...
متن کاملThe Minmax Regret Shortest Path Problem with Interval Arc Lengths
This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملUncertain Programming Models for Shortest Path Problem with Uncertain Arc Lengths
Shortest path problem is a fundamental problem in network optimization and combinational optimization. The existing literature mainly concerned with the problem in deterministic, stochastic or fuzzy environments by using different tools. Different from the existing works, we investigate shortest path problem by regarding arc lengths as uncertain variables which are employed to describe the beha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1985
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90059-9